Addition and subspace theorems for asymptotic large inductive dimension
نویسندگان
چکیده
منابع مشابه
5 Addition and Subspace Theorems for Asymptotic Large Inductive Dimension
We prove addition and subspace theorems for asymptotic large inductive dimension. We investigate a transfinite extension of this dimension and show that it is trivial. 0. Asymptotic dimension asdim of a metric space was defined by Gromov for studying asymptotic invariants of discrete groups [1]. This dimension can be considered as asymptotic analogue of the Lebesgue covering dimension dim. Dran...
متن کاملAN INDUCTIVE FUZZY DIMENSION
Using a system of axioms among with a modified definition of boundary on the basis of the intuitionistic fuzzy sets, we formulate an inductive structure for the dimension of fuzzy spaces which has been defined by Coker. This new definition of boundary allows to characterize an intuitionistic fuzzy clopen set as a set with zero boundary. Also, some critical properties and applications are establ...
متن کاملIsotropic Constant Dimension Subspace Codes
In network code setting, a constant dimension code is a set of k-dimensional subspaces of F nq . If F_q n is a nondegenerated symlectic vector space with bilinear form f, an isotropic subspace U of F n q is a subspace that for all x, y ∈ U, f(x, y) = 0. We introduce isotropic subspace codes simply as a set of isotropic subspaces and show how the isotropic property use in decoding process, then...
متن کاملInductive Sparse Subspace Clustering
Sparse Subspace Clustering (SSC) has achieved state-of-the-art clustering quality by performing spectral clustering over a ℓ 1-norm based similarity graph. However, SSC is a transductive method which does not handle with the data not used to construct the graph (out-of-sample data). For each new datum, SSC requires solving n optimization problems in O(n) variables for performing the algorithm o...
متن کاملAsymptotic Analysis of Subspace
Asymptotic analysis methods for performance prediction of so-called subspace direction-of-arrival estimation methods has been developed earlier, assuming that a large-enough number of array measurements, or snapshots, is collected. This paper also addresses the problem of making performance predictions, but for beamspace-based subspace methods. The novel approach in this paper assumes the numbe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 2006
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm106-1-5